1 Timed Zero - Knowledge Proof ( Tzkp ) Protocol

نویسندگان

  • T. C. Lam
  • Cheng-Chung Tan
  • Yu-Jen Chang
  • Jyh-Charn Liu
چکیده

Incorporating time to the security management system is an important step to streamline its integration with other resource management functions in the real-time distributed systems. In addition to protecting its security properties, minimizing operational overheads of security management is also a major design issue. In this paper, we propose a timed zero knowledge proof (TZKP) protocol to support the session based secure access control of timed resources for anonymous consumers. On the basis of Eng-Okamoto’s general disposable authentication (GDA) model, we show that the service provider (SP) can authorize the timed resource access by adding session to a control variable in GDA. The consumer who receives timed access authorizations (TAAs) from the SP may choose to transfer them to others. In classical ZKP protocols, each transfer instance requires spending of one consumer token, which makes this desirable feature costly. To minimize the transfer overhead, we propose the multisource reusability (MSR) condition that allows a consumer to reuse its token for multiple transactions with protected anonymity when no double spending of TAA occurs. TZKP not only reduces the amount of tokens that need to be withdrawn by consumers, but also eliminates the need to keep track of the tokens once their marked sessions are expired. On the basis of the proven security properties of GDA in each session, together with the introduction of session time and the reduced cost transfers, we show that TZKP protocol can be efficiently used for secure access of the shared computing resources for anonymous consumers. Experiments run on DETER testbed show that TZKP has small to moderate run time, and can be easily expanded for large scale applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Timed-Release Cryptography

Let n be a large composite number. Without factoring n, the computation of a t (mod n) given a, t with gcd(a; n) = 1 and t < n can be done in t squarings modulo n. For t n (e.g., n > 2 and t < 2), no lower complexity than t squarings is known to ful ll this task. Rivest et al suggested to use such constructions as good candidates for realising timed-release crypto problems. We argue the necessi...

متن کامل

Cmsc 858k — Advanced Topics in Cryptography

In a previous lecture, we saw how to construct a three-round zero-knowledge (ZK) proof system for graph 3-colorability with soundness error 1 − 1/ |E| on a common input G = (V,E). The soundness error can be made negligible, while maintaining zero knowledge, by repeating the protocol |E| · ω(log k) times sequentially (where k is the security parameter); unfortunately, this increases the round co...

متن کامل

Witness Indistinguishable Proofs and Constant Round Zero Knowledge

Blum’s Hamiltonicity protocol. We used Protocol 1.2 to prove this. We let HAM denote the NP-complete language of all Hamiltonian graphs (i.e., n vertex graphs that contain the n-cycle as a subgraph). Blum’s basic protocol for proving membership in HAM is Protocol 1.2. It is a 3-round public-coin proof for HAM with soundness error equal to 1 2 . Theorem 1.3 (Feige Shamir). If a protocol is zero-...

متن کامل

Batch Proofs of Partial Knowledge

We present a practical attack on the soundness of Peng and Bao’s ‘batch zero-knowledge proof and verification’ protocol for proving knowledge and equality of one-out-of-n pairs of discrete logarithms. Fixing the protocol seems to require a commitment scheme with a nonstandard, mercurial-esque binding property: the prover commits to just n− 1 values, but later opens the commitment to n values wi...

متن کامل

Efficient zero knowledge proofs of knowledge for homomorphisms

Efficient zero-knowledge proofs of knowledge for homomorphisms are a key building block in a vast number of constructions in applied cryptography. Examples are: identification-, signature-, group signature-, anonymous credential-, and identity escrow-schemes as well as voting systems, e-cash, multi-party computations, and trusted computing. This dissertation studies efficient zero-knowledge pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006